Approximation schemes for knapsack problems with shelf divisions

نویسندگان

  • Eduardo C. Xavier
  • Flávio Keidi Miyazawa
چکیده

Given a knapsack of size K, non-negative values d and ∆, and a set S of items, each item e ∈ S with size se and value ve, we define a shelf as a subset of items packed inside a bin with total items size at most ∆. Two subsequent shelves must be separated by a shelf divisor of size d. The size of a shelf is the total size of its items plus the size of the shelf divisor. The Shelf-Knapsack Problem (SK) is to find a subset S ⊆ S partitioned into shelves with total shelves size at most K and maximum value. The Class Constrained Shelf Knapsack (CCSK) is a generalization of the problem SK, where each item in S has a class and each shelf in the solution must have only items of the same class. We present approximation schemes for the SK and the CCSK problems. To our knowledge, these are the first approximation results where shelves of non-null size are used in knapsack problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biorthogonal wavelet-based full-approximation schemes for the numerical solution of elasto-hydrodynamic lubrication problems

Biorthogonal wavelet-based full-approximation schemes are introduced in this paper for the numerical solution of elasto-hydrodynamic lubrication line and point contact problems. The proposed methods give higher accuracy in terms of better convergence with low computational time, which have been demonstrated through the illustrative problems.

متن کامل

General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems

While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies about their approximation. For a bounded number of scenarios, we establish general approximation schemes which can be used for min-max and min-max regret versions of some polynomial or pseudo-polynomial problems. Applying ...

متن کامل

Stochastic Load Balancing and Related Problems

We study the problems of makespan minimization (load balancing), knapsack, and bin packing when the jobs have stochastic processing requirements or sizes. If the jobs are all Poisson, we present a two approximation for the first problem using Graham’s rule, and observe that polynomial time approximation schemes can be obtained for the last two problems. If the jobs are all exponential, we prese...

متن کامل

Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product

We address a version of the Half-Product Problem and its restricted variant with a linear knapsack constraint. For these minimization problems of Boolean programming, we focus on the development of fully polynomial-time approximation schemes with running times that depend quadratically on the number of variables. Applications to various single machine scheduling problems are reported: minimizin...

متن کامل

Optimization Problems with Approximation Schemes

In this paper we extend recent work about the relationship between the syntactic description of NP optimization problems and their approximation properties. In contrast to Max SNP we consider problems that take arbitrary weighted structures as input instances and we use the framework of Metaanite Model Theory 5] to get a more general deenability theory of optimization problems. We deene a class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 352  شماره 

صفحات  -

تاریخ انتشار 2006